#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
const int N = 2e5 + 5;

int n, m;
int a[N];
void solve() {
  cout << "Discarded cards:";

  queue<int> q;
  rep(i, 1, n) q.push(i);
  bool start = true;
  while (q.size() >= 2) {
    int x = q.front();
    q.pop();
    int y = q.front();
    q.pop();
    if (start)
      start = !start;
    else
      cout << ",";
    cout << " " << x;
    q.push(y);
  }
  cout << endl;
  cout << "Remaining card: " << q.front() << endl;
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  while (cin >> n && n) solve();
  return 0;
}